Thus, if I were to write a schema to represent my particular linked list, there is no guarantee that another person will read my schema and extract from it the same data model. 因此,如果我写了一个只代表我特别链表的模式,就不能保证有其他人会读我的模式并从中提取相同的数据模型。
Every user-specified keyword and its attributes are read from a user-specified file and stored as a node on a linked list, called Key_List. 所有用户指定的关键字及其属性将从用户指定的文件中读取,并存储为链接列表中的一个节点(称为KeyList)。
One we referenced earlier is the implementation of a doubly linked list in the SPL class SplDoublyLinkedList. 我们前面提到一个类就是在SPL类SplDoublyLinkedList中实现的双重链接列表。
The linked list hash table contains information about the shared memory logging token pointers. 这个链表散列表包含有关共享内存日志标记指针的信息。
A linked list can be used to store this information. 可以使用相连的列表存储这些信息。
In this example, I have used the "printlist" alias to print the complete linked list. 在此示例中,我使用“printlist”别名输出整个链表。
At the highest level is the cache_chain, which is a linked list of the slab caches. 在最高层是cachechain,这是一个slab缓存的链接列表。
The work queue is generally implemented as some sort of linked list with an associated monitor object. 该工作队列通常被实现成具有相关监视器对象的某种链表。
Each queue contains a linked list of threads or is empty. 每个队列包含一个线程链表(或者为空)。
AXIOM allows many different object factory implementations, but the linked list is by far the most popular. AXIOM允许很多不同的对象工厂实现,但链表是最常用的。
The solution in this case is to change the links in the linked list to also be weak references. 在这种情况下,解决办法就是也将链接列表中的链接更改为弱引用。
There are two basic update operations performed in standard linked list implementations: inserting and removing a node from the list. 在标准的列表实现中,有两中基本更新操作:向列表中插入(inserting)节点和从列表中删除(removing)节点。
The problem arises when I try to create an XML Schema that describes the linked list structure. 当我试图创建一个描述链表结构的XMLSchema,问题产生了。
Further, I can have a look at the linked list contents using the already available commands in dbx. 然后,可以使用dbx中的现有命令查看链表的内容。
Now that the mutex is unlocked, other threads can access and modify the linked list, possibly adding items. 现在互斥对象已被解锁,其它线程可以访问和修改已链接列表,可能还会添加项。
A lookup data structure which is a linked list is then initialized. 然后初始化一个查找数据结构,这是一个链表。
Disorder can be two and a single linked list and into a single linked list! 可以将两个无序的单链表和并成一个单链表!
Generally, if you've ever taken a programming course, you probably know what a doubly linked list is. 一般来说,如果你曾经采取了编程过程中,你可能知道什么是双向链表的。
And two-way linked list is a list as well as data structures, one of the standard data structure. 而双向链表是链表的一种,也是数据结构的标准数据结构之一。
Glue to double linked list nodes or other data types. 粘附到双向链接的列表节点或其他数据类型。
Basically, as items are added to the list, they are appended to a doubly linked list. 基本上,在项目添加到列表中,他们被追加到一个双向链表。
Recordsets are organized as linked list ( CList) and you can access them using their ids. 记录集是连接起来的记录的集合,你可以通过他们的ID访问他们。
The method of dealing with collisions should be the dynamic linked list version. 此方法处理冲突的时候应该采用动态链表。
Some programmers like to start off a linked list with a dummy node that's always empty. 有些程序员喜欢以一个总是为空的哑元节点(不表示实际数据的节点)为一个链表的开始节点。
Supports a second ordering option: maintaining the linked list in access order instead of insertion order. 支持第二种排序选项:按存取顺序而非插入顺序维护链表。
This procedure is based on the realization of two-way linked list, a good interpretation of this particular data structure. 这个程序是基于双向链表实现的,很好地诠释了此特殊的数据结构。
Append four nodes to the linked list. 将四个节点追加到链接列表。
Error: While deleting the linked list holding the enumerated products that can be checked out. 错误:当删除保存有能够被检验的列举产品链接表时。
In addition to the standard hashing relationship, there is now a linked list that traverses through the collection. 除标准的散列关系之外,现在还有一个可遍历整个集合的链表。
Modify the linked list template class, so that node data fields to the data class class object. 修改单链表模板类,使结点类的数据域改为数据类对象的指针。